Generalized Property Directed Reachability
نویسندگان
چکیده
The IC3 algorithm was recently introduced for proving properties of finite state reactive systems. It has been applied very successfully to hardware model checking. We provide a specification of the algorithm using an abstract transition system and highlight its dual operation: model search and conflict resolution. We then generalize it along two dimensions. Along one dimension we address nonlinear fixed-point operators (push-down systems) and evaluate the algorithm on Boolean programs. In the second dimension we leverage proofs and models and generalize the method to Boolean constraints involving theories. 1
منابع مشابه
Generalized loop-erased random walks and approximate reachability
In this paper we extend the loop-erased random walk (LERW) to the directed hypergraph setting. We then generalize Wilson’s algorithm for uniform sampling of spanning trees to directed hypergraphs. In several special cases, this algorithm perfectly samples spanning hypertrees in expected polynomial time. Our main application is to the reachability problem, also known as the directed all-terminal...
متن کاملIncremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. However, in the proposed algorithm, called IICTL, the analysis is directed by task states that are pushed down the parse tree. To each node is associated overand under-approximations to the set of states satisfying tha...
متن کاملProgram Verification with Property Directed Reachability
Program Verification with Property Directed Reachability by Tobias Welp Doctor of Philosophy in Engineering–Electrical Engineering and Computer Sciences University of California, Berkeley Professor Andreas Kuehlmann, Chair As a consequence of the increasing use of software in safety-critical systems and the considerable risk associated with their failure, effective and efficient algorithms for ...
متن کاملA Tableau-Based Decision Procedure for a Fragment of Graph Theory Involving Reachability and Acyclicity
We study the decision problem for the language DGRA (directed graphs with reachability and acyclicity), a quantifier-free fragment of graph theory involving the notions of reachability and acyclicity. We prove that the language DGRA is decidable, and that its decidability problem is NP -complete. We do so by showing that the language enjoys a small model property : If a formula is satisfiable, ...
متن کاملA Memo on Computability in Time Petri Nets
Time Petri nets were introduced by Merlin in [5] in order to study recoverability problems in computer systems and the design of communication protocols. Berthomieu and Menasche in [2] res. Berthomieu and Diaz in [1] provide a method for the analysis of the qualitative behavior of the net. They divide the state spaces in state classes which are describe by a marking and time domain given by ine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012